t = int(input())
for _ in range(t):
n, q = map(int, input().split())
final_sum = 0
num_even = 0
num_odd = 0
for x in (input().split()):
x = int(x)
final_sum += x
if x % 2:
num_odd += 1
num_even = n - num_odd
for i in range(q):
type, to_add = map(int, input().split())
if type == 0:
final_sum += to_add * num_even
if to_add % 2:
num_odd += num_even
num_even = 0
else:
final_sum += to_add * num_odd
if to_add % 2:
num_even += num_odd
num_odd = 0
print(final_sum)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--)
{
int n, q, ch = 0, nch = 0;
long long sum = 0;
cin >> n >> q;
vector<int> a;
vector<int> type;
vector<int> k;
for(int i = 0; i < n; i++)
{
int x;
cin >> x;
a.push_back(x);
sum += x;
}
for(int i = 0; i < q; i++)
{
int x, y;
cin >> x >> y;
type.push_back(x);
k.push_back(y);
}
for(int i = 0; i < n; i++)
{
if (a[i] % 2 == 0) ch++;
else nch++;
}
for(int i = 0; i < q; i++)
{
if(type[i] == 1) sum += nch * k[i];
else sum += ch * k[i];
if(k[i] % 2 != 0 && type[i] == 0) {nch += ch; ch = 0;}
if(k[i] % 2 != 0 && type[i] == 1) {ch += nch; nch = 0;}
cout << sum << endl;
}
}
}
1279A - New Year Garland | 1279B - Verse For Santa |
202A - LLPS | 978A - Remove Duplicates |
1304A - Two Rabbits | 225A - Dice Tower |
1660D - Maximum Product Strikes Back | 1513A - Array and Peaks |
1251B - Binary Palindromes | 768B - Code For 1 |
363B - Fence | 991B - Getting an A |
246A - Buggy Sorting | 884A - Book Reading |
1180A - Alex and a Rhombus | 445A - DZY Loves Chessboard |
1372A - Omkar and Completion | 159D - Palindrome pairs |
981B - Businessmen Problems | 1668A - Direction Change |
1667B - Optimal Partition | 1668B - Social Distance |
88B - Keyboard | 580B - Kefa and Company |
960A - Check the string | 1220A - Cards |
897A - Scarborough Fair | 1433B - Yet Another Bookshelf |
1283B - Candies Division | 1451B - Non-Substring Subsequence |